Design and Verify: A New Scheme for Generating Cutting-Planes
نویسندگان
چکیده
A cutting-plane procedure for integer programming (IP) problems usually involves invoking a blackbox procedure (such as the Gomory-Chvátal (GC) procedure) to compute a cutting-plane. In this paper, we describe an alternative paradigm of using the same cutting-plane black-box. This involves two steps. In the first step, we design an inequality cx ≤ d where c and d are integral, independent of the cutting-plane black-box. In the second step, we verify that the designed inequality is a valid inequality by verifying that the set P ∩ {x ∈ R | cx ≥ d + 1} ∩ Z is empty using cutting-planes from the black-box. Here P is the feasible region of the linear-programming relaxation of the IP. We refer to the closure of all cutting-planes that can be verified to be valid using a specific cutting-plane black-box as the verification closure of the considered cutting-plane black-box. This paper undertakes a systematic study of properties of verification closures of various cutting-plane black-box procedures.
منابع مشابه
Generation of a reduced first - level mixed integer programmimg problem
We introduce a new way of generating cutting planes of a mixed integer programme by way of taking binary variables. Four binary variables are introduced to form quartic inequalities, which results in a reduced first-level mixed integer programme. A new way of weakening the inequalities is presented. An algorithm to carryout the separation of the inequalities, which are exponential in number, is...
متن کاملCutting Planes for Multistage Stochastic Integer Programs
This paper addresses the problem of finding cutting planes for multi-stage stochastic integer programs.We give a general method for generating cutting planes for multi-stage stochastic integer programs basedon combining inequalities that are valid for the individual scenarios. We apply the method to generatecuts for a stochastic version of a dynamic knapsack problem and to stochasti...
متن کاملKnapsack-Based Cutting Planes for the Max-Cut Problem
We present a new procedure for generating cutting planes for the max-cut problem. The procedure consists of three steps. First, we generate a violated (or near-violated) linear inequality that is valid for the semidefinite programming (SDP) relaxation of the max-cut problem. This can be done by computing the minimum eigenvalue of a certain matrix. Second, we use this linear inequality to constr...
متن کاملOn the Generation of Cutting Planes which Maximize the Bound Improvement
We propose the bound-optimal cutting plane method. It is a new paradigm for cutting plane generation in Mixed Integer Programming allowing for the simultaneous generation of k cuts which, when added to the current Linear Programming relaxation, yield the largest bound improvement. By Linear Programming duality arguments and standard linearization techniques we show that, for a large family of c...
متن کاملMultilevel Input Ring-Tcm Coding Scheme: a Method for Generating High-Rate Codes
The capability of multilevel input ring-TCM coding scheme for generating high-rate codes with improved symbol Hamming and squared Euclidean distances is demonstrated. The existence of uniform codes and the decoder complexity are also considered.
متن کامل